________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 20:26:24
Input Data from:  dataset125.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :10
Ex.Facilities   :2
Total budget    :20000
Terror. attacks :1

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,0633333333333333
Average f[i]   :4100
Average g[i,j] :1912,5
Total demand   :17270
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 25
> Selected Move:	2850	1	-1	7	4000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0    >new incumb.: 2850


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 25
> Selected Move:	4230	1	-1	9	10500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  1    >new incumb.: 4230


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 21
> Selected Move:	5590	1	-1	8	15000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1    >new incumb.: 5590


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 19
> Selected Move:	6200	1	-1	4	21000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 15
> Selected Move:	6070	3	8	6	21000


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 15
> Selected Move:	5820	3	4	8	19500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  1    >new incumb.: 5820


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 19
> Selected Move:	5750	3	6	5	20500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 14
> Selected Move:	5682	3	5	3	20500


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 14
> Selected Move:	5660	3	9	4	20000


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 17
> Selected Move:	5570	3	3	6	19000


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 24
> Selected Move:	5550	3	8	3	20000


> New Y[]: 
	
	 2  3  0  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 18
> Selected Move:	5562	3	4	9	20500


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 12 #######################


> Neighbours evaluated; 14
> Selected Move:	5630	3	3	5	20500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 13 #######################


> Neighbours evaluated; 14
> Selected Move:	5460	3	5	2	19500


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 14 #######################


> Neighbours evaluated; 16
> Selected Move:	5590	3	6	8	19500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 15 #######################


> Neighbours evaluated; 16
> Selected Move:	5320	3	9	4	19000


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 16 #######################


> Neighbours evaluated; 19
> Selected Move:	5450	3	2	5	20000


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 17 #######################


> Neighbours evaluated; 19
> Selected Move:	5340	3	8	6	20000


> New Y[]: 
	
	 2  3  0  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 18 #######################


> Neighbours evaluated; 19
> Selected Move:	5210	3	5	2	19000


> New Y[]: 
	
	 2  3  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 19 #######################


> Neighbours evaluated; 25
> Selected Move:	5212	3	7	9	21500


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 20 #######################


> Neighbours evaluated; 17
> Selected Move:	5350	3	6	8	21500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 21 #######################


> Neighbours evaluated; 16
> Selected Move:	5280	2	2	-1	17000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 22 #######################


> Neighbours evaluated; 14
> Selected Move:	5340	3	8	7	16500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 23 #######################


> Neighbours evaluated; 15
> Selected Move:	5460	3	4	6	15000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 24 #######################


> Neighbours evaluated; 14
> Selected Move:	5210	3	9	4	14500


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 25 #######################


> Neighbours evaluated; 17
> Selected Move:	5320	3	6	8	14500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 26 #######################


> Neighbours evaluated; 15
> Selected Move:	5270	3	0	9	16300


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 27 #######################


> Neighbours evaluated; 7
> Selected Move:	5270	4	9	4	17100


> New Y[]: 
	
	 0  3  0  0  2  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 28 #######################


> Neighbours evaluated; 6
> Selected Move:	5270	4	4	7	18900


> New Y[]: 
	
	 0  3  0  0  1  0  0  2  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 29 #######################


> Neighbours evaluated; 5
> Selected Move:	5270	4	7	8	18300


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 30 #######################


> Neighbours evaluated; 12
> Selected Move:	5140	3	8	6	19000


> New Y[]: 
	
	 0  3  0  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 31 #######################


> Neighbours evaluated; 8
> Selected Move:	5140	4	6	4	17100


> New Y[]: 
	
	 0  3  0  0  2  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 32 #######################


> Neighbours evaluated; 7
> Selected Move:	5140	4	4	7	18900


> New Y[]: 
	
	 0  3  0  0  1  0  1  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 33 #######################


> Neighbours evaluated; 7
> Selected Move:	5150	3	7	0	17000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 34 #######################


> Neighbours evaluated; 11
> Selected Move:	5140	3	1	7	19000


> New Y[]: 
	
	 2  0  0  0  1  0  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 35 #######################


> Neighbours evaluated; 9
> Selected Move:	5270	3	6	8	19000


> New Y[]: 
	
	 2  0  0  0  1  0  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 36 #######################


> Neighbours evaluated; 8
> Selected Move:	5270	4	7	4	16500


> New Y[]: 
	
	 2  0  0  0  3  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 37 #######################


> Neighbours evaluated; 9
> Selected Move:	5270	4	4	8	18100


> New Y[]: 
	
	 2  0  0  0  1  0  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 38 #######################


> Neighbours evaluated; 7
> Selected Move:	5270	4	8	9	16700


> New Y[]: 
	
	 2  0  0  0  1  0  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 39 #######################


> Neighbours evaluated; 13
> Selected Move:	5140	3	8	6	16700


> New Y[]: 
	
	 2  0  0  0  1  0  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 40 #######################


> Neighbours evaluated; 8
> Selected Move:	5140	4	9	4	16500


> New Y[]: 
	
	 2  0  0  0  3  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 41 #######################


> Neighbours evaluated; 7
> Selected Move:	5145	1	-1	8	21000


> New Y[]: 
	
	 2  0  0  0  3  0  1  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 42 #######################


> Neighbours evaluated; 13
> Selected Move:	5080	4	4	9	21200


> New Y[]: 
	
	 2  0  0  0  1  0  1  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 43 #######################


> Neighbours evaluated; 17
> Selected Move:	4856	3	6	2	21200


> New Y[]: 
	
	 2  0  1  0  1  0  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 44 #######################


> Neighbours evaluated; 7
> Selected Move:	4930	4	9	4	21000


> New Y[]: 
	
	 2  0  1  0  3  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 45 #######################


> Neighbours evaluated; 7
> Selected Move:	4940	3	2	3	22000


> New Y[]: 
	
	 2  0  0  1  3  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 46 #######################


> Neighbours evaluated; 11
> Selected Move:	4862	4	4	9	22200


> New Y[]: 
	
	 2  0  0  1  1  0  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 47 #######################


> Neighbours evaluated; 11
> Selected Move:	4721	3	8	6	22200


> New Y[]: 
	
	 2  0  0  1  1  0  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 48 #######################


> Neighbours evaluated; 8
> Selected Move:	4780	4	9	4	22000


> New Y[]: 
	
	 2  0  0  1  3  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 49 #######################


> Neighbours evaluated; 10
> Selected Move:	4785	3	3	2	21000


> New Y[]: 
	
	 2  0  1  0  3  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 50 #######################


> Neighbours evaluated; 12
> Selected Move:	4708	4	4	9	21200


> New Y[]: 
	
	 2  0  1  0  1  0  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 51 #######################


> Neighbours evaluated; 11
> Selected Move:	4480	2	7	-1	17200


> New Y[]: 
	
	 2  0  1  0  1  0  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 52 #######################


> Neighbours evaluated; 9
> Selected Move:	4610	3	6	8	17200


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 53 #######################


> Neighbours evaluated; 7
> Selected Move:	4660	3	9	1	15000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 54 #######################


> Neighbours evaluated; 17
> Selected Move:	4930	3	4	9	15500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 55 #######################


> Neighbours evaluated; 18
> Selected Move:	5160	1	-1	6	20000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 56 #######################


> Neighbours evaluated; 23
> Selected Move:	4950	3	6	5	21000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 57 #######################


> Neighbours evaluated; 16
> Selected Move:	4875	3	5	3	21000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 58 #######################


> Neighbours evaluated; 14
> Selected Move:	4800	3	9	4	20500


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 59 #######################


> Neighbours evaluated; 19
> Selected Move:	4910	3	3	6	19500


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 60 #######################


> Neighbours evaluated; 26
> Selected Move:	4910	3	2	9	21500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 61 #######################


> Neighbours evaluated; 19
> Selected Move:	4758	1	-1	7	25500


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 62 #######################


> Neighbours evaluated; 5
> Selected Move:	5180	4	0	9	20800


> New Y[]: 
	
	 0  3  0  0  1  0  1  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 63 #######################


> Neighbours evaluated; 10
> Selected Move:	5140	2	8	-1	16300


> New Y[]: 
	
	 0  3  0  0  1  0  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 64 #######################


> Neighbours evaluated; 16
> Selected Move:	4812	1	-1	2	20800


> New Y[]: 
	
	 0  3  1  0  1  0  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 65 #######################


> Neighbours evaluated; 6
> Selected Move:	4938	3	6	8	20800


> New Y[]: 
	
	 0  3  1  0  1  0  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 66 #######################


> Neighbours evaluated; 5
> Selected Move:	4854	3	2	3	21800


> New Y[]: 
	
	 0  3  0  1  1  0  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 67 #######################


> Neighbours evaluated; 10
> Selected Move:	4715	3	8	6	21800


> New Y[]: 
	
	 0  3  0  1  1  0  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 68 #######################


> Neighbours evaluated; 10
> Selected Move:	4601	3	4	8	20300


> New Y[]: 
	
	 0  3  0  1  0  0  1  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 69 #######################


> Neighbours evaluated; 11
> Selected Move:	4800	3	9	0	18500


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 70 #######################


> Neighbours evaluated; 26
> Selected Move:	4960	3	6	5	19500


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 71 #######################


> Neighbours evaluated; 17
> Selected Move:	4870	3	3	6	18500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 72 #######################


> Neighbours evaluated; 24
> Selected Move:	4850	3	8	3	19500


> New Y[]: 
	
	 2  3  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 73 #######################


> Neighbours evaluated; 24
> Selected Move:	4510	3	3	2	18500


> New Y[]: 
	
	 2  3  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 74 #######################


> Neighbours evaluated; 26
> Selected Move:	4750	3	7	9	21000


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 75 #######################


> Neighbours evaluated; 17
> Selected Move:	4800	2	5	-1	15500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 76 #######################


> Neighbours evaluated; 18
> Selected Move:	4680	3	6	4	17000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 77 #######################


> Neighbours evaluated; 16
> Selected Move:	4885	1	-1	7	21000


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 78 #######################


> Neighbours evaluated; 17
> Selected Move:	4780	3	2	3	22000


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 79 #######################


> Neighbours evaluated; 14
> Selected Move:	4580	3	3	5	22000


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 80 #######################


> Neighbours evaluated; 14
> Selected Move:	4640	2	4	-1	16000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 81 #######################


> Neighbours evaluated; 20
> Selected Move:	4620	3	9	8	14000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 82 #######################


> Neighbours evaluated; 20
> Selected Move:	4620	1	-1	2	18500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 83 #######################


> Neighbours evaluated; 21
> Selected Move:	4578	3	7	4	20500


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 84 #######################


> Neighbours evaluated; 21
> Selected Move:	4465	3	8	6	20500


> New Y[]: 
	
	 2  3  1  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 85 #######################


> Neighbours evaluated; 24
> Selected Move:	4673	3	5	3	20500


> New Y[]: 
	
	 2  3  1  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 86 #######################


> Neighbours evaluated; 24
> Selected Move:	4700	3	4	9	21000


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 87 #######################


> Neighbours evaluated; 17
> Selected Move:	4440	3	9	7	18500


> New Y[]: 
	
	 2  3  1  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 88 #######################


> Neighbours evaluated; 25
> Selected Move:	4550	3	6	8	18500


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 89 #######################


> Neighbours evaluated; 22
> Selected Move:	4550	2	2	-1	14000


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 90 #######################


> Neighbours evaluated; 18
> Selected Move:	4570	3	8	9	16000


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 91 #######################


> Neighbours evaluated; 18
> Selected Move:	4510	3	7	8	16500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 92 #######################


> Neighbours evaluated; 15
> Selected Move:	4580	3	3	5	16500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 93 #######################


> Neighbours evaluated; 14
> Selected Move:	4570	3	0	7	18400


> New Y[]: 
	
	 0  3  0  0  0  1  0  2  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 94 #######################


> Neighbours evaluated; 7
> Selected Move:	4570	4	7	5	16600


> New Y[]: 
	
	 0  3  0  0  0  2  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 95 #######################


> Neighbours evaluated; 6
> Selected Move:	4570	4	5	8	17800


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 96 #######################


> Neighbours evaluated; 5
> Selected Move:	4570	4	8	9	15800


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 97 #######################


> Neighbours evaluated; 13
> Selected Move:	4676	1	-1	6	20300


> New Y[]: 
	
	 0  3  0  0  0  1  1  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 98 #######################


> Neighbours evaluated; 11
> Selected Move:	4662	3	6	4	21800


> New Y[]: 
	
	 0  3  0  0  1  1  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 99 #######################


> Neighbours evaluated; 9
> Selected Move:	4541	3	8	6	21800


> New Y[]: 
	
	 0  3  0  0  1  1  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 100 #######################


> Neighbours evaluated; 11
> Selected Move:	4440	2	4	-1	15800


> New Y[]: 
	
	 0  3  0  0  0  1  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 101 #######################


> Neighbours evaluated; 9
> Selected Move:	4510	3	9	0	14000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 102 #######################


> Neighbours evaluated; 20
> Selected Move:	4460	3	5	8	13000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 103 #######################


> Neighbours evaluated; 25
> Selected Move:	4460	1	-1	2	17500


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 104 #######################


> Neighbours evaluated; 26
> Selected Move:	4390	3	0	9	19300


> New Y[]: 
	
	 0  3  1  0  0  0  1  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 105 #######################


> Neighbours evaluated; 9
> Selected Move:	4458	3	6	5	20300


> New Y[]: 
	
	 0  3  1  0  0  1  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 106 #######################


> Neighbours evaluated; 6
> Selected Move:	4429	3	2	3	21300


> New Y[]: 
	
	 0  3  0  1  0  1  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 107 #######################


> Neighbours evaluated; 9
> Selected Move:	4500	2	5	-1	15800


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 108 #######################


> Neighbours evaluated; 7
> Selected Move:	4500	4	9	3	16500


> New Y[]: 
	
	 0  3  0  2  0  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 109 #######################


> Neighbours evaluated; 7
> Selected Move:	4698	1	-1	4	22500


> New Y[]: 
	
	 0  3  0  2  1  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 110 #######################


> Neighbours evaluated; 6
> Selected Move:	4674	4	3	4	22600


> New Y[]: 
	
	 0  3  0  1  2  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 111 #######################


> Neighbours evaluated; 8
> Selected Move:	4932	3	3	6	21600


> New Y[]: 
	
	 0  3  0  0  2  0  1  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 112 #######################


> Neighbours evaluated; 13
> Selected Move:	4694	3	6	2	21600


> New Y[]: 
	
	 0  3  1  0  2  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 113 #######################


> Neighbours evaluated; 8
> Selected Move:	4610	2	7	-1	17600


> New Y[]: 
	
	 0  3  1  0  2  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 114 #######################


> Neighbours evaluated; 5
> Selected Move:	4610	4	4	2	18900


> New Y[]: 
	
	 0  3  2  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 115 #######################


> Neighbours evaluated; 4
> Selected Move:	4610	4	2	8	18800


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 116 #######################


> Neighbours evaluated; 3
> Selected Move:	4610	4	8	9	16800


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 117 #######################


> Neighbours evaluated; 8
> Selected Move:	4480	3	8	6	16800


> New Y[]: 
	
	 0  3  1  0  1  0  1  0  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 118 #######################


> Neighbours evaluated; 6
> Selected Move:	4550	3	9	0	15000


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 119 #######################


> Neighbours evaluated; 21
> Selected Move:	4150	3	2	8	15000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 120 #######################


> Neighbours evaluated; 24
> Selected Move:	4400	3	4	9	15500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 121 #######################


> Neighbours evaluated; 18
> Selected Move:	4455	1	-1	5	21000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 122 #######################


> Neighbours evaluated; 20
> Selected Move:	4535	3	6	4	22500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 123 #######################


> Neighbours evaluated; 13
> Selected Move:	4758	3	5	3	22500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 124 #######################


> Neighbours evaluated; 15
> Selected Move:	4830	1	-1	7	26500


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 125 #######################


> Neighbours evaluated; 8
> Selected Move:	4858	3	3	2	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 126 #######################


> Neighbours evaluated; 9
> Selected Move:	4700	3	8	6	25500


> New Y[]: 
	
	 2  3  1  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 127 #######################


> Neighbours evaluated; 8
> Selected Move:	4668	3	2	3	26500


> New Y[]: 
	
	 2  3  0  1  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 128 #######################


> Neighbours evaluated; 7
> Selected Move:	4615	2	7	-1	22500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 129 #######################


> Neighbours evaluated; 15
> Selected Move:	4393	3	3	5	22500


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 130 #######################


> Neighbours evaluated; 14
> Selected Move:	4450	2	4	-1	16500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 131 #######################


> Neighbours evaluated; 13
> Selected Move:	4440	3	0	7	18400


> New Y[]: 
	
	 0  3  0  0  0  1  1  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 132 #######################


> Neighbours evaluated; 8
> Selected Move:	4440	4	7	5	16600


> New Y[]: 
	
	 0  3  0  0  0  2  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 133 #######################


> Neighbours evaluated; 8
> Selected Move:	4440	4	5	6	18500


> New Y[]: 
	
	 0  3  0  0  0  1  2  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 134 #######################


> Neighbours evaluated; 10
> Selected Move:	4390	3	5	8	17500


> New Y[]: 
	
	 0  3  0  0  0  0  2  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 135 #######################


> Neighbours evaluated; 11
> Selected Move:	4390	4	6	7	17400


> New Y[]: 
	
	 0  3  0  0  0  0  1  2  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 136 #######################


> Neighbours evaluated; 9
> Selected Move:	4500	3	6	3	18400


> New Y[]: 
	
	 0  3  0  1  0  0  0  2  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 137 #######################


> Neighbours evaluated; 5
> Selected Move:	4500	4	7	8	17800


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 138 #######################


> Neighbours evaluated; 10
> Selected Move:	4390	3	3	6	16800


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 139 #######################


> Neighbours evaluated; 10
> Selected Move:	4478	1	-1	4	22800


> New Y[]: 
	
	 0  3  0  0  1  0  1  1  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 140 #######################


> Neighbours evaluated; 12
> Selected Move:	4580	3	8	3	22500


> New Y[]: 
	
	 0  3  0  2  1  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 141 #######################


> Neighbours evaluated; 7
> Selected Move:	4557	4	3	4	22600


> New Y[]: 
	
	 0  3  0  1  2  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 142 #######################


> Neighbours evaluated; 7
> Selected Move:	4580	3	3	2	21600


> New Y[]: 
	
	 0  3  1  0  2  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 143 #######################


> Neighbours evaluated; 9
> Selected Move:	4480	2	7	-1	17600


> New Y[]: 
	
	 0  3  1  0  2  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 144 #######################


> Neighbours evaluated; 6
> Selected Move:	4480	4	4	2	18900


> New Y[]: 
	
	 0  3  2  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 145 #######################


> Neighbours evaluated; 5
> Selected Move:	4480	4	2	6	19500


> New Y[]: 
	
	 0  3  1  0  1  0  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 146 #######################


> Neighbours evaluated; 8
> Selected Move:	4080	3	2	8	19500


> New Y[]: 
	
	 0  3  0  0  1  0  2  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 147 #######################


> Neighbours evaluated; 9
> Selected Move:	4363	1	-1	7	23500


> New Y[]: 
	
	 0  3  0  0  1  0  2  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 148 #######################


> Neighbours evaluated; 8
> Selected Move:	4542	3	6	5	22600


> New Y[]: 
	
	 0  3  0  0  1  2  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 149 #######################


> Neighbours evaluated; 6
> Selected Move:	4529	4	5	4	22600


> New Y[]: 
	
	 0  3  0  0  2  1  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 150 #######################


> Neighbours evaluated; 8
> Selected Move:	4386	3	8	6	22600


> New Y[]: 
	
	 0  3  0  0  2  1  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 151 #######################


> Neighbours evaluated; 7
> Selected Move:	4373	4	4	5	22600


> New Y[]: 
	
	 0  3  0  0  1  2  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 152 #######################


> Neighbours evaluated; 9
> Selected Move:	4415	3	4	8	21100


> New Y[]: 
	
	 0  3  0  0  0  2  1  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 153 #######################


> Neighbours evaluated; 13
> Selected Move:	4375	3	5	3	21000


> New Y[]: 
	
	 0  3  0  2  0  0  1  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 154 #######################


> Neighbours evaluated; 16
> Selected Move:	4370	2	8	-1	16500


> New Y[]: 
	
	 0  3  0  2  0  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 155 #######################


> Neighbours evaluated; 8
> Selected Move:	4370	4	3	6	18500


> New Y[]: 
	
	 0  3  0  1  0  0  2  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 156 #######################


> Neighbours evaluated; 7
> Selected Move:	4370	4	6	7	18400


> New Y[]: 
	
	 0  3  0  1  0  0  1  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 157 #######################


> Neighbours evaluated; 7
> Selected Move:	4380	3	7	0	16500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 158 #######################


> Neighbours evaluated; 16
> Selected Move:	4440	3	9	7	14000


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 159 #######################


> Neighbours evaluated; 17
> Selected Move:	4370	3	0	9	15800


> New Y[]: 
	
	 0  3  0  1  0  0  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 160 #######################


> Neighbours evaluated; 9
> Selected Move:	4390	3	3	8	14800


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 161 #######################


> Neighbours evaluated; 12
> Selected Move:	4160	3	6	2	14800


> New Y[]: 
	
	 0  3  1  0  0  0  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 162 #######################


> Neighbours evaluated; 7
> Selected Move:	4389	1	-1	3	20300


> New Y[]: 
	
	 0  3  1  1  0  0  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 163 #######################


> Neighbours evaluated; 6
> Selected Move:	4261	3	8	6	20300


> New Y[]: 
	
	 0  3  1  1  0  0  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 164 #######################


> Neighbours evaluated; 7
> Selected Move:	4332	3	3	5	20300


> New Y[]: 
	
	 0  3  1  0  0  1  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 165 #######################


> Neighbours evaluated; 7
> Selected Move:	4319	3	2	3	21300


> New Y[]: 
	
	 0  3  0  1  0  1  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 166 #######################


> Neighbours evaluated; 8
> Selected Move:	4080	4	9	3	22000


> New Y[]: 
	
	 0  3  0  2  0  1  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 167 #######################


> Neighbours evaluated; 10
> Selected Move:	4200	3	6	8	22000


> New Y[]: 
	
	 0  3  0  2  0  1  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 168 #######################


> Neighbours evaluated; 8
> Selected Move:	4154	4	3	5	22100


> New Y[]: 
	
	 0  3  0  1  0  2  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 169 #######################


> Neighbours evaluated; 9
> Selected Move:	4169	3	3	2	21100


> New Y[]: 
	
	 0  3  1  0  0  2  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 170 #######################


> Neighbours evaluated; 6
> Selected Move:	4130	3	5	3	21000


> New Y[]: 
	
	 0  3  1  2  0  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 171 #######################


> Neighbours evaluated; 9
> Selected Move:	4043	3	9	4	20500


> New Y[]: 
	
	 0  3  1  2  1  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 172 #######################


> Neighbours evaluated; 10
> Selected Move:	4290	3	2	6	20500


> New Y[]: 
	
	 0  3  0  2  1  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 173 #######################


> Neighbours evaluated; 17
> Selected Move:	4249	4	3	4	20600


> New Y[]: 
	
	 0  3  0  1  2  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 174 #######################


> Neighbours evaluated; 16
> Selected Move:	4230	2	6	-1	16100


> New Y[]: 
	
	 0  3  0  1  2  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 175 #######################


> Neighbours evaluated; 11
> Selected Move:	4250	3	8	9	18100


> New Y[]: 
	
	 0  3  0  1  2  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 176 #######################


> Neighbours evaluated; 7
> Selected Move:	4250	4	4	3	18000


> New Y[]: 
	
	 0  3  0  2  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 177 #######################


> Neighbours evaluated; 7
> Selected Move:	4250	4	3	7	19900


> New Y[]: 
	
	 0  3  0  1  1  0  0  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 178 #######################


> Neighbours evaluated; 7
> Selected Move:	4260	3	7	0	18000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 179 #######################


> Neighbours evaluated; 18
> Selected Move:	4300	3	9	7	15500


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 180 #######################


> Neighbours evaluated; 21
> Selected Move:	4300	1	-1	2	20000


> New Y[]: 
	
	 2  3  1  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 181 #######################


> Neighbours evaluated; 22
> Selected Move:	4368	3	4	9	20500


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 182 #######################


> Neighbours evaluated; 19
> Selected Move:	4440	3	3	5	20500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 183 #######################


> Neighbours evaluated; 17
> Selected Move:	4388	3	2	3	21500


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 184 #######################


> Neighbours evaluated; 18
> Selected Move:	4140	3	7	8	22000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 185 #######################


> Neighbours evaluated; 13
> Selected Move:	4355	3	5	6	21000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 186 #######################


> Neighbours evaluated; 18
> Selected Move:	4295	3	9	4	20500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 187 #######################


> Neighbours evaluated; 24
> Selected Move:	4240	2	6	-1	16000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 188 #######################


> Neighbours evaluated; 18
> Selected Move:	4230	3	0	7	17900


> New Y[]: 
	
	 0  3  0  1  1  0  0  2  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 189 #######################


> Neighbours evaluated; 10
> Selected Move:	4230	4	7	3	16000


> New Y[]: 
	
	 0  3  0  2  1  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 190 #######################


> Neighbours evaluated; 8
> Selected Move:	4230	4	3	8	17300


> New Y[]: 
	
	 0  3  0  1  1  0  0  1  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 191 #######################


> Neighbours evaluated; 13
> Selected Move:	4250	3	8	9	17300


> New Y[]: 
	
	 0  3  0  1  1  0  0  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 192 #######################


> Neighbours evaluated; 9
> Selected Move:	4190	3	1	8	18900


> New Y[]: 
	
	 0  0  0  1  1  0  0  1  3  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,415

## ITERATION 193 #######################


> Neighbours evaluated; 9
> Selected Move:	4230	3	9	0	17100


> New Y[]: 
	
	 2  0  0  1  1  0  0  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 194 #######################


> Neighbours evaluated; 12
> Selected Move:	4500	3	4	9	17600


> New Y[]: 
	
	 2  0  0  1  0  0  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 195 #######################


> Neighbours evaluated; 10
> Selected Move:	4570	3	3	5	17600


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 196 #######################


> Neighbours evaluated; 9
> Selected Move:	4570	4	8	5	17000


> New Y[]: 
	
	 2  0  0  0  0  3  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 197 #######################


> Neighbours evaluated; 9
> Selected Move:	4570	4	5	7	18500


> New Y[]: 
	
	 2  0  0  0  0  1  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 198 #######################


> Neighbours evaluated; 8
> Selected Move:	4570	4	7	9	16200


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 199 #######################


> Neighbours evaluated; 14
> Selected Move:	4553	1	-1	4	22200


> New Y[]: 
	
	 2  0  0  0  1  1  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 200 #######################


> Neighbours evaluated; 9
> Selected Move:	4640	4	9	4	22000


> New Y[]: 
	
	 2  0  0  0  3  1  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 201 #######################


> Neighbours evaluated; 8
> Selected Move:	4520	3	8	6	22000


> New Y[]: 
	
	 2  0  0  0  3  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 202 #######################


> Neighbours evaluated; 9
> Selected Move:	4456	4	4	9	22200


> New Y[]: 
	
	 2  0  0  0  1  1  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 203 #######################


> Neighbours evaluated; 10
> Selected Move:	4545	3	4	8	20700


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 204 #######################


> Neighbours evaluated; 13
> Selected Move:	4471	3	5	3	20700


> New Y[]: 
	
	 2  0  0  1  0  0  1  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 205 #######################


> Neighbours evaluated; 16
> Selected Move:	4500	2	6	-1	16200


> New Y[]: 
	
	 2  0  0  1  0  0  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,38
________________________________________________________________

Best solution found: 5820
Run Termination time: 03.02.2010 20:26:47
Run duration: 00:00:22.6718750
________________________________________________________________
